A Fully abstract presheaf semantics for SCCS with finite delay

A Fully Abstract Presheaf Semantics of SCCS with Finite Delay

We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...

Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay?

We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...

Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay

A Fixpoint Approach to Finite Delay and Fairness

We introduce a language SCCS with a restriction operation on recursion. This involves a relativization of processes to formal environments which can be seen as a simple typing of processes. The fragment SCCS of SCCS drops explicit typing by introducing both least and greatest xpoint operators. SCCS is expressive enough so that both SCCS and the Finite Delay Calculus of Milner 21] can be regarde...

The Semantics of Fair Recursion with Divergence

We recast Milner's work on SCCS, a calculus for nite but unbounded delay based on SCCS, by giving a denotational semantics for admissibility of innnite computations on a biinite domain K. Using Abramsky's SFP domain D for bisimulation we obtain a fully abstract model in D K for an operational pre-order which generalizes Milner's fortiication. Our preorder includes divergence and its restriction...